Mesh shape-quality optimization using the inverse mean-ratio metric
نویسنده
چکیده
Meshes containing elements with bad quality can result in poorly conditioned systems of equations that must be solved when using a discretization method, such as the finite-element method, for solving a partial differential equation. Moreover, such meshes can lead to poor accuracy in the approximate solution computed. In this paper, we present a nonlinear fractional program that relocates the vertices of a given mesh to optimize the average element shape quality as measured by the inverse mean-ratio metric. To solve the resulting large-scale optimization problems, we apply an efficient implementation of an inexact Newton algorithm using the conjugate gradient method with a block Jacobi preconditioner to compute the direction. We show that the block Jacobi preconditioner is positive definite by proving a general theorem concerning the convexity of fractional functions, applying this result to components of the inverse meanratio metric, and showing that each block in the preconditioner is invertible. Numerical results obtained with this special-purpose code on several test meshes are presented and used to quantify the impact on solution time and memory requirements of using a modeling language and general-purpose algorithm to solve these problems.
منابع مشابه
Mesh Shape-Quality Optimization Using the Inverse Mean-Ratio Metric: Tetrahedral Proofs
This technical report is a companion to [5] that proves the diagonal blocks of the Hessian matrix for the inverse mean-ratio metric for tetrahedral elements are positive definite. Thus, the block Jacobi preconditioner used in the inexact Newton method to solve the mesh shape-quality optimization problem using the average inverse mean-ratio metric for the objective function is positive definite....
متن کاملObtaining smooth mesh transitions using vertex optimization
Mesh optimization has proven to be an effective way to improve mesh quality for arbitrary Lagrangian Eulerian (ALE) simulations. To date, however, most of the focus has been on improving the geometric shape of individual elements, and these methods often do not result in smooth transitions in element size or aspect ratio across groups of elements. We present an extension to the mean ratio optim...
متن کاملA geometrical approach to mesh smoothing
We study the problem of smoothing finite element meshes of triangles and tetrahedra, where vertices are recursively moved to improve the overall quality of the elements with respect to a given shape quality metric. We propose a geometric approach to solving the local optimization problem. Level sets of the given metric are used to characterize the set of optimal point(s). We also introduce a ne...
متن کاملAn Alternating Mesh Quality Metric Scheme for Efficient Mesh Quality Improvement
In the numerical solution of partial differential equations (PDEs), high-quality meshes are crucial for the stability, accuracy, and convergence of the associated PDE solver. Mesh quality improvement is often performed to improve the quality of meshes before use in numerical solution of the PDE. Mesh smoothing (performed via optimization) is one popular technique for improving the mesh quality;...
متن کاملA Comparison of Inexact Newton and Coordinate Descent Mesh Optimization Techniques
We compare inexact Newton and coordinate descent methods for optimizing the quality of a mesh by repositioning the vertices, where quality is measured by the harmonic mean of the mean-ratio metric. The effects of problem size, element size heterogeneity, and various vertex displacement schemes on the performance of these algorithms are assessed for a series of tetrahedral meshes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 110 شماره
صفحات -
تاریخ انتشار 2007